Ray Tracing with Rope Trees
نویسنده
چکیده
In this paper an acceleration method for finding the nearest ray–object intersection for ray tracing purposes is presented. We use the concept of BSP trees enriched by rope trees. These are used to accelerate the traversal of the BSP tree. We give a comparison of experimental results between the technique based on BSP tree and uniform spatial subdivision.
منابع مشابه
Accelerated Ray Tracing using R-Trees
Efficient ray tracing for rendering needs to minimize the number of redundant intersection tests between rays and geometric primitives. Hence, ray tracers usually employ spatial indexes to organize the scene to be rendered. The most popular ones for this purpose are currently kd-trees and bounding volume hierarchies, for they have been found to yield best performances and can be adapted to cont...
متن کاملShell: Accelerating Ray Tracing on GPU
Ray tracing is a fundamental process in many areas including computer graphics and medical applications. Different hierarchical acceleration structures for ray tracing have been developed. Such ray tracing approaches executed on advanced many-core processors such as GPU, however, turns out to be memory bounded due to their frequent search operations in the hierarchical structures. This paper pr...
متن کاملA hybrid CPU-GPU Implementation for Interactive Ray-Tracing of Dynamic Scenes
In recent years, applying the powerful computational resources delivered by modern GPUs to ray tracing has resulted in a number of ray tracing implementations that allow rendering of moderately sized scenes at interactive speeds. For non-static scenes, besides ray tracing performance, fast construction of acceleration data structures such as kd-trees is of primary concern. In this paper, we pre...
متن کاملRay tracing of dynamic scenes
In the last decade ray tracing performance reached interactive frame rates for nontrivial scenes, which roused the desire to also ray trace dynamic scenes. Changing the geometry of a scene, however, invalidates the precomputed auxiliary data-structures needed to accelerate ray tracing. In this thesis we review and discuss several approaches to deal with the challenge of ray tracing dynamic scen...
متن کاملFast Implicit Kd-trees: Accelerated Isosurface Ray Tracing and Maximum Intensity Projection for Large Scalar Fields
Many scientific data sets are 3D or 4D scalar fields, for which typically isosurfaceand volume visualization methods are used to extract information. These data sets are either massively complex (e.g., seismic data sets), or steadily increasing in size due to the permanently improving resolutions of different 3D scanners (e.g., CTand MRTscanners) or calculation results (e.g., CFD-simulations). ...
متن کامل